منابع مشابه
Batch Coloring Tree-like Graphs
Batch scheduling of conflicting jobs is modeled by batch coloring of a graph. Given an undirected graph and the number of colors required by each vertex, we need to find a proper batch coloring of the graph, i.e., partition the vertices to batches which are independent sets, and to assign to each batch a contiguous set of colors, whose size equals to the maximum color requirement of any vertex ...
متن کاملBatch Coloring Flat Graphs and Thin
Batch scheduling of conflicting jobs is modeled by batch coloring of a graph. Given an undirected graph and the number of colors required by each vertex, we need to find a proper batch coloring of the graph, namely, to partition the vertices to batches which are independent sets and assign to each batch a contiguous set of colors, whose size is equal to the maximum color requirement of any vert...
متن کاملEdge-coloring Vertex-weightings of Graphs
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملClassical Coloring of Graphs
Despite the variety of graph coloring models discussed in published papers of a theoretical nature, the classical model remains one of the most significant and widely applied in practice. The NP-hardness of the coloring problem gives rise to the necessity of using suboptimal methods in a wide range of practical applications. Moreover, the large range of problems solved by classical coloring, as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2017
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-017-0386-1